https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 d-lucky labeling of graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:26288 v∈N(v)l(v) + d(u), where d(u) denotes the degree of u and N(u) denotes the open neighborhood of u. In this paper we introduce a new labeling called d-lucky labeling and study the same as a vertex coloring problem. We define a labeling l as d-lucky if c(u) ≠ c(v), for every pair of adjacent vertices u and v in G. The d-lucky number of a graph G, denoted by ηdl(G), is the least positive k such that G has a d-lucky labeling with {1,2,...,k} as the set of labels. We obtain ηdl(G) = 2 for hypercube network, butterfly network, benes network, mesh network, hypertree and X-tree.]]> Wed 11 Apr 2018 16:49:46 AEST ]]> Star-labeled digraphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11673 Sat 24 Mar 2018 08:08:43 AEDT ]]> Metric dimension of directed graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:20385 Sat 24 Mar 2018 07:58:08 AEDT ]]> Minimum linear arrangement of incomplete hypercubes https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:27495 Sat 24 Mar 2018 07:25:39 AEDT ]]> A lower bound for dilation of an embedding https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:24372 Sat 24 Mar 2018 07:16:18 AEDT ]]> A note on the locating-total domination in graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:32759 Mon 23 Jul 2018 11:04:20 AEST ]]> Exact wirelength of embedding chord graph into tree-based architectures https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:34725 Fri 26 Apr 2019 15:59:25 AEST ]]>